The graph of perfect matching polytope and an extreme problem
نویسندگان
چکیده
منابع مشابه
Csc5160: Combinatorial Optimization and Approximation Algorithms Topic: Perfect Matching Polytope 12.1 Formulation of General Perfect Matching
In this lecture, the focus is on general perfect matching problem where the goal is to prove that it can be solved in polynomial time by linear programming. Based on the LP formulation for bipartite matching studied in Lecture 10, we add some valid inequalities to establish a new formulation. Then we prove that for general perfect matching, all vertex solutions of the linear program are integra...
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملThe graph of an abstract polytope
Recently a generalization of simple convex polytopes to combinatorial entit ies known as abstract polytopes has been proposed. The graph of an abstract polytope o f d imension d is a regular connected graph of degree d. Given a connected regular graph F o f degree d, it is interesting to find out whether it is the graph of some abstract polytope P. We obtain necessary and sufficient condit ions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.03.009